New Data Structures for Orthogonal Range Searching
نویسندگان
چکیده
We present new general techniques for static orthogonal range searching problems in two and higher dimensions. For the general range reporting problem in , we achieve query time using space , where denotes the number of stored points and the number of points to be reported. For the range reporting problem on an ! " grid, we achieve query time # $ % & using space ' ( . For the two-dimensional semi-group range sum problem we achieve query time ' ) * using space ' ) * .
منابع مشابه
Orthogonal Range Searching for Text Indexing
Text indexing, the problem in which one desires to preprocess a (usually large) text for future (shorter) queries, has been researched ever since the suffix tree was invented in the early 70’s. With textual data continuing to increase and with changes in the way it is accessed, new data structures and new algorithmic methods are continuously required. Therefore, text indexing is of utmost impor...
متن کاملSearching for Frequent Colors in Rectangles
We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction τ of all points in Q are of color c, must be reported. We describe several data structures for that problem that use pseudo-linear space and answer queries in poly-logarithmic time.
متن کاملLower bound techniques for data structures
We describe new techniques for proving lower bounds on data-structure problems, with the following broad consequences: • the first Ω(lg n) lower bound for any dynamic problem, improving on a bound that had been standing since 1989; • for static data structures, the first separation between linear and polynomial space. Specifically, for some problems that have constant query time when polynomial...
متن کاملExternal Memory Orthogonal Range Reporting with Fast Updates
In this paper we describe data structures for orthogonal range reporting in external memory that support fast update operations. The query costs either match the query costs of the best previously known data structures or differ by a small multiplicative factor.
متن کاملSpace Efficient Data Structures for Dynamic Orthogonal Range Counting
We present a linear-space data structure that maintains a dynamic set of n points with coordinates of real numbers on the plane to support orthogonal range counting, as well as insertions and deletions, in O(( lgn lg lgn )) time. This provides faster support for updates than previous results with the same bounds on space cost and query time. We also obtain two other new results by considering t...
متن کامل